Semidefinite representation of convex hulls of rational varieties
نویسنده
چکیده
Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is, it can be represented as a projection of an affine section of the cone of positive semidefinite matrices) in the case of (a) curves; (b) hypersurfaces parameterized by quadratics; and (c) hypersurfaces parameterized by bivariate quartics; all in an ambient space of arbitrary dimension.
منابع مشابه
Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints
{(f1(x), . . . , fm(x)) : x ∈ T } for quadratic polynomials f0, . . . , fm and a subset T of R . This paper studies semidefinite representation of the convex hull conv(V ) or its closure, i.e., describing conv(V ) by projections of spectrahedra (defined by linear matrix inequalities). When T is defined by a single quadratic constraint, we prove that conv(V ) is equal to the first order moment t...
متن کاملSemidefinite Representation for Convex Hulls of Real Algebraic Curves
We prove that the closed convex hull of any one-dimensional semialgebraic subset of Rn has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is proved by an application of the moment relaxation method. Given a nonsingular affine real algebraic curve C and a compact semi-algebraic subset K of its R-poin...
متن کاملSome results on the polynomial numerical hulls of matrices
In this note we characterize polynomial numerical hulls of matrices $A in M_n$ such that$A^2$ is Hermitian. Also, we consider normal matrices $A in M_n$ whose $k^{th}$ power are semidefinite. For such matriceswe show that $V^k(A)=sigma(A)$.
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملEla Semidefinite Geometry of the Numerical Range
Abstract. The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular, it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI), an affine section of the semidefinite cone, is always dual to the numerical range of a matrix, which is therefore an affine projection of the semid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0901.1821 شماره
صفحات -
تاریخ انتشار 2009